Locating one pairwise interaction : Three recursive constructions ∗
نویسندگان
چکیده
In a complex component-based system, choices (levels) for components (factors) may interact to cause faults in the system behaviour. When faults may be caused by interactions among few factors at specific levels, covering arrays provide a combinatorial test suite for discovering the presence of faults. While well studied, covering arrays do not enable one to determine the specific levels of factors causing the faults; locating arrays ensure that the results from test suite execution suffice to determine the precise levels and factors causing faults, when the number of such causes is small. Constructions for locating arrays are at present limited to heuristic computational methods and quite specific direct constructions. In this paper three recursive constructions are developed for locating arrays to locate one pairwise interaction causing a fault. 2010 MSC: 05B30, 05A18, 05D99, 62K05, 68P10
منابع مشابه
Pairwise additive 1-rotational BIB designs with λ=1
The existence of pairwise additive balanced incomplete block (BIB) designs and pairwise additive cyclic BIB designs with λ = 1 has been discussed through direct and recursive constructions in the literature. This paper takes BIB designs with 1-rotational automorphisms and then the existence of pairwise additive 1-rotational BIB designs is investigated for λ = 1. Finally, it is shown that there ...
متن کاملAsymptotic Behavior of Eigenfunctions of the Three-particle Schrödinger Operator. Ii. Charged One-dimensional Particles
A system of three one-dimensional quantum particles with Coulomb pairwise interaction is treated. A scattered plane wave type asymptotic description at infinity in the configuration space of generalized eigenfunctions is obtained. Though remaining at a heuristic level, the constructions of the paper may serve as a basis for rigorous proofs of the results.
متن کاملRecursive constructions for triangulations
Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2an 2−o(n2) non-isomorphic face 2-colourable triangulations of Kn and Kn,n,n in orientable and non-orientable surfaces for values of n lying in certain residue classes and for appropriate constants a.
متن کاملUniform Designs and Their Combinatorial Constructions
Uniform designs has been widely used in various fields. In this talk, two constructions for uniform designs from combinatorics are presented. One is obtained by resolvable PPBDs which serves to unify some known combinatorial constructions. The other provides a recursive method to obtain a new three-level uniform design from old one.
متن کاملConstructions for generalized Steiner systems GS (3, 4, v , 2)
Generalized Steiner systems GS (3, 4, v, 2) were first discussed by Etzion and used to construct optimal constant weight codes over an alphabet of size three with minimum Hamming distance three, in which each codeword has length v and weight four. Not much is known for GS (3, 4, v, 2)s except for a recursive construction and two small designs for v = 8, 10 given by Etzion. In this paper, more s...
متن کامل